Randomized Rounding
نویسنده
چکیده
One of the key ideas in randomized algorithms is that good outcomes are likely enough to happen if we flip coins. This allows us to avoid distinguishing many cases and treating each separately. In this lecture, we will study one particular such technique, which allows us to design approximation algorithms. In all of our algorithms, we will rely on linear programs (LPs). The examples are selected in a way that it is not necessary to have much background in LP theory. As a matter of fact, we will only need that LPs of polynomial size can be solved in polynomial time.
منابع مشابه
Randomized Rounding without Solving the Linear Program 33
We introduce a new technique called oblivious rounding | a variant of randomized rounding that avoids the bottleneck of rst solving the linear program. Avoiding this bottleneck yields more eecient algorithms and brings probabilistic methods to bear on a new class of problems. We give oblivious rounding algorithms that approximately solve general packing and covering problems, including a parall...
متن کامل